Dirty Paper Writing and Watermarking Applications

نویسنده

  • G. RaviKiran
چکیده

Following an underlying theme in Communication is the duo of Dirty Paper Writing and Watermarking. In 1983 utilising some previous results by Gelfand, Pinsker, El Gamal and Heegard, Costa gave a method for acheiving capacity in the presence of a known interference. Costa, in his paper, doesn’t mention about any applications of his result, let alone Watermarking. In 1999 Cox et al recognised the similarity between the two. The summary will be arranged in the following order. Dirty Paper writing will be dealt with in Section 2, an introduction to watermarking and some of the issues related to it in Section 3. The relation between Watermarking and Dirty Paper Coding, and the concept of Quantisation Index Modulation will be discussed in Section 4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On " Dirty-paper Coding "

regardless of what Q is. The title of Costa’s work came by making an analogy to the problem of writing on dirty paper, where the reader cannot nominally distinguish dirt from ink. There are many scenarios where this result may be applied. In the field of information hiding (or watermarking), a message is encoded in u, which is to be embedded in the host waveform i using the signal s. Data compr...

متن کامل

Fast Embedding Technique for Dirty Paper Trellis Watermarking

This paper deals with the improvement of the Dirty Paper Trellis Code (DPTC) watermarking algorithm. This watermarking algorithm is known to be one of the best among the high rate watermarking schemes. Nevertheless, recent researches reveal its security weakness. Previously, we proposed to reinforce its security by using a secret space before the embedding. This secret space requires to compute...

متن کامل

Nested Codes for Constrained Memory and for Dirty Paper

Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to some classes of constrained memories, and we explore the binary so-called nested codes, which are used for e cient coding and error-correction on such channels and memories.

متن کامل

A novel embedding technique for dirty paper trellis codes watermarking

→ Security weakness (Kerckhoffs's framework). Code book estimable on a simplified version [2]. → High computational complexity of the Embedding part Lin et al. [3] solution is not enough satisfying in term of robustness-distortion tradeoff. → DCT artifacts. [1] “Applying Informed Coding and Informed Embedding to Design a Robust, High Capacity Watermark”, Miller, Doërr, and Cox, IEEE TIP 2004. [...

متن کامل

Informed Detection Revisited

Watermarking systems can employ either informed detection, where the original cover work is required, or blind detection, where it is not required. While early systems used informed detection, recent work has focused on blind detection, because it is considered more challenging and general. Further, recent work on “dirty-paper watermarking” has suggested that informed detection provides no bene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003